Dirichlet Spaces Associated with Locally Finite Rooted Directed Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4-PLACEMENT OF ROOTED TREES

A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.

متن کامل

Distinguishability of Locally Finite Trees

The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity element of Aut(X) fixes (setwise) every inverse image f−1(k), k ∈ {0, 1, 2, · · · , n − 1}. All infinite, locally finite trees without pendant vertices are shown to be 2distinguishable. A proof is indicated that extends 2-disti...

متن کامل

Rooted Trees with Probabilities Revisited

Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average Node-Sum Interchange Theorem (LANSIT) and the well-known applications to path length and leaf entropy are re-stated. The LANSIT is then applied to informational...

متن کامل

Finite dimensional comodules over the Hopf algebra of rooted trees

In [1, 3, 4, 5], a Hopf algebra of rooted trees HR was introduced. It was shown that the antipode of this algebra was the key of a problem of renormalization ([8]). HR is related to the Hopf algebra HCM introduced in [2]. Moreover, the dual algebra of HR is the enveloping algebra of the Lie algebra of rooted trees L. An important problem was to give an explicit construction of the primitive ele...

متن کامل

MODELING ROOTED IN-TREES BY FINITE p-GROUPS

Graph theoretic foundations for a kind of infinite rooted in-trees T (R) = (V,E) with root R, weighted vertices v ∈ V , and weighted directed edges e ∈ E ⊂ V × V are described. Vertex degrees deg(v) are always finite but the trees contain infinite paths (vi)i≥0. A concrete group theoretic model of the rooted in-trees T (R) is introduced by representing vertices by isomorphism classes of finite ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Integral Equations and Operator Theory

سال: 2017

ISSN: 0378-620X,1420-8989

DOI: 10.1007/s00020-017-2400-z